The Roman Elegiac Poets. Karl Pomeroy Harrington

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Roman Poets as Literary Historians Some Aspects of Imitatio ^

Literary history — like the history of any art — involves a special difficulty; it is that of reconciling a general scheme of development and a linear movement in time with the problem of the individual genius who creates new things. That has not been made easier in recent years when New Critics tried to expel the writer from the text, and then Deconstructionists called the very existence of th...

متن کامل

The Impermanent Text in Catullus and Other Roman Poets

To us, who have lived our entire lives in a culture saturated with print, it seems obvious that the survival of a verbal artifact for any length of time would be impossible without material texts. To a writer, getting published is the necessary first step toward a potentially limitless Nachleben. The fact that, ceteris paribus, a new book is more likely to be pulped within a few years than to s...

متن کامل

Banishing the Poets

The main argument of this monograph,* if I understand it rightly (something its rather cloudy writing makes me uncertain of), is that the body of works often (and traditionally) grouped together under the rubric ‘ancient literary criticism’ should be understood not as contributions to aesthetics or criticism of literature as these terms are commonly understood today but rather as political inte...

متن کامل

The Paris-Harrington Theorem

In Ramsey theory, very large numbers and fast-growing functions are more of a rule than an exception. The classical Ramsey numbers R(n,m) are known to be of exponential size: the original proof directly gives the upper bound R(n,m) ≤ ( m+n−2 n−1 ) , and an exponential lower bound is also known. For the van der Waerden numbers, the original proof produced upper bounds that were not even primitiv...

متن کامل

2 Leo Harrington And

1. Introduction A set A of nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Classical Philology

سال: 1915

ISSN: 0009-837X,1546-072X

DOI: 10.1086/360013